On the structure of plane graphs of minimum face size 5
نویسنده
چکیده
A subgraph of a plane graph is light if the sum of the degrees of the vertices of the subgraph in the graph is small. It is known that a plane graph of minimum face size 5 contains light paths and a light pentagon. In this paper we show that every plane graph of minimum face size 5 contains also a light star K1,3 and we present a structural result concerning the existence of a pair of adjacent faces with degree– bounded vertices.
منابع مشابه
Numerical Modeling and Experimental Study of Probe-Fed Rectangular Dielectric Resonator Antenna (RDRA) Supported by Finite Circular Ground Plane
Dielectric Resonator Antennas (DRAs) have received increased interest in recent years for their potential applications in microwave and millimeter wave communication systems. DRAs are normally used with the support of a ground plane. The radiation and impedance properties therefore depend not only on their physical dimensions and dielectric properties, but also on the size of the ground plane. ...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملColoring plane graphs with independent crossings
We show that every plane graph with maximum face size four whose all faces of size four are vertex-disjoint is cyclically 5-colorable. This answers a question of Albertson whether graphs drawn in the plane with all crossings independent are 5-colorable.
متن کاملThe Center and Periphery of Composite Graphs
The center (periphery) of a graph is the set of vertices with minimum (maximum) eccentricity. In this paper, the structure of centers and peripheries of some classes of composite graphs are determined. The relations between eccentricity, radius and diameter of such composite graphs are also investigated. As an application we determine the center and periphery of some chemical graphs such as nan...
متن کاملChoosability of planar graphs of girth 5
Thomassen proved that any plane graph of girth 5 is list-colorable from any list assignment such that all vertices have lists of size two or three and the vertices with list of size two are all incident with the outer face and form an independent set. We present a strengthening of this result, relaxing the constraint on the vertices with list of size two. This result is used to bound the size o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 24 شماره
صفحات -
تاریخ انتشار 2004